package 力扣日常刷题.木22二月.第15天221;

/**
 * @author 帅小伙
 * @date 2022/2/21
 * @description
 */
public class Demo121编辑距离 {

    public int minDistance(String word1, String word2) {
        int n = word1.length(), m = word2.length();
        if (n * m == 0) return n + m;
        int[][] dp = new int[n + 1][m + 1];

        for (int i = 0; i < n + 1; i++) dp[i][0] = i;
        for (int i = 0; i < m + 1; i++) dp[0][m] = i;

        for (int i = 1; i < n + 1; i++) {
            for (int j = 1; j < m + 1; j++) {
                int left = dp[i - 1][j] + 1;
                int down = dp[i][j - 1] + 1;
                int leftDown = dp[i - 1][j - 1];
                if (word1.charAt(i - 1) != word2.charAt(j - 1)) leftDown++;
                dp[i][j] = Math.min(leftDown, Math.min(left, down));
            }
        }
        return dp[n][m];

    }

}
